The Application of Fault-Tolerant Partition Resolvability in Cycle-Related Graphs

نویسندگان

چکیده

The concept of metric-related parameters permeates all graph theory and plays an important role in diverse networks, such as social computer biological networks neural networks. include incredible tool for analyzing the abstract structures An parameter is partition dimension a holding auspicious applications telecommunication, robot navigation geographical routing protocols. A fault-tolerant resolving preference dimension. system if failure any single unit originally used chain replaced by another units not containing faulty unit. Due to optimal fault tolerance, cycle-related graphs have network analysis, periodic scheduling surface reconstruction. In this paper, it shown that (PD) (FTPD) graphs, including kayak paddle flower are constant free from order these graphs. More explicitly, FTPD four, whereas PD three. Finally, application scenario installing water reservoirs locality has also been furnished verify our findings.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fault-tolerant cycle-embedding in alternating group graphs

a r t i c l e i n f o a b s t r a c t In a recently published paper [Z.-J. Xue, S.-Y. Liu, An optimal result on fault-tolerant cycle-embedding in alternating group graphs, Inform. the authors showed that for a set of faulty vertices F in an n-dimensional alternating group graph AG n , AG n − F remains pancyclic if |F | 2n − 6. However, the proof of the result is flawed. We will prove the theore...

متن کامل

INTEGER-MAGIC SPECTRA OF CYCLE RELATED GRAPHS

For any h in N , a graph G = (V, E) is said to be h-magic if there exists a labeling l: E(G) to Z_{h}-{0} such that the induced vertex set labeling l^{+: V(G) to Z_{h}} defined by l^{+}(v)= Summation of l(uv)such that e=uvin in E(G) is a constant map. For a given graph G, the set of all for which G is h-magic is called the integer-magic spectrum of G and is denoted by IM(G). In this paper, the ...

متن کامل

Realizability of Fault Tolerant Graphs∗

A connected graph G is optimal-κ if the connectivity κ(G) = δ(G), where δ(G) is the minimum degree of G. It is super-κ if every minimum vertex cut isolates a vertex. An optimal-κ graph G is moptimal-κ if for any vertex set S ⊆ V (G) with |S| ≤ m, G−S is still optimal-κ. The maximum integer of such m, denoted by Oκ(G), is the vertex fault tolerance of G with respect to the property of optimal-κ....

متن کامل

application of brand personality scale in automobile industry: the study of samand’s brand personality dimensions

این تحقیق شخصیت برند سمند را در ایران با استفاده از مدل پنج بعدی آکر (1997) بعنوان یک چهارچوب بطور توصیفی سنجیده است. بنابر این چهارچوب که دراصل در 42 جزء (42 ویزگی شخصیتی) ودر پنج بعد شخصیتی طراحی شده بود ودر کشورها وصنایع مختلف آزموده شده بود, پرسنامه به زبان فارسی ترجمه شده و با استفاده از روشهای ترجمه معکوس و مصاحبه عمیق با 12 متخصص ایرانی به 38 جزء کاهش یافت. و نظرسنجی ای در پنج نمایندگی ا...

15 صفحه اول

Fault-Tolerant Graphs for Tori

Motivated by the design of fault-tolerant multiprocessor interconnection networks, this paper considers the following problem: Given a positive integer t and a graph H , construct a graph G from H by adding a minimum number D( t , H ) of edges such that even after deleting any t edges from G the remaining graph contains H as a subgraph. We estimate D( t , H ) for the torus, which is well known ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied sciences

سال: 2022

ISSN: ['2076-3417']

DOI: https://doi.org/10.3390/app12199558